NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
901	Blocked Clause Elimination and its Extensions Marijn J. H. Heule∗ joint work with Matti J¨arvisalo and Armin Biere Abstract Boolean satisfiability (SAT) has become a core technology in many application Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 08:16:51 NP-complete problems Conjunctive normal form Automated theorem proving Boolean satisfiability problem Resolution Logic programming 2-satisfiability Theoretical computer science Mathematics Applied mathematics
902	Sage Reference Manual: Games Release 6.6.beta0 The Sage Development Team February 21, 2015 Add to Reading List Source URL: sagemath.org Language: English - Date: 2015-02-21 07:35:21 Search algorithms Applied mathematics Recreational mathematics Puzzle video games Dancing Links Backtracking Exact cover Puzzle Sudoku algorithms Mathematics Sudoku NP-complete problems
903	Scotch and libScotch 5.1 User’s Guide (version[removed]Fran¸cois Pellegrini Bacchus team, INRIA Bordeaux Sud-Ouest IPB & LaBRI, UMR CNRS 5800 Add to Reading List Source URL: gforge.inria.fr Language: English NP-complete problems Scotch Shortest path problem Graph partition Algorithm Nested dissection Graph Mathematics Theoretical computer science Graph theory
904	Using a satisfiability solver to identify deterministic finite state automata Marijn J.H. Heule Sicco Verwer Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-08-19 05:30:10 NP-complete problems Complexity classes Logic in computer science Boolean algebra Boolean satisfiability problem Electronic design automation Graph coloring SL NP-complete Theoretical computer science Mathematics Computational complexity theory
905	will the next generation act? mathematics and policy need to meet in preschool Where the language of mathematics cannot be heard, neither can reason. Yet mathematics remains culturally unintegrated while the future depe Add to Reading List Source URL: files.howtolivewiki.com Language: English - Date: 2014-04-16 02:48:14 Recreational mathematics Puzzles Mechanical puzzles Combination puzzles NP-complete problems Mathematical game Lego Martin Gardner Toy Games Mathematics Digital media
906	This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 2011 proceedings Completion Delay Minimization for Instantly Decodable Networ Add to Reading List Source URL: www.comm.utoronto.ca Language: English - Date: 2011-12-23 16:23:54 NP-complete problems Clique Network coding Shortest path problem Maximal independent set Path decomposition Graph theory Theoretical computer science Mathematics
907	Sudoku as a SAT Problem Inˆes Lynce IST/INESC-ID, Technical University of Lisbon, Portugal [removed] Jo¨el Ouaknine Add to Reading List Source URL: anytime.cs.umass.edu Language: English - Date: 2005-11-17 08:28:24 NP-complete problems Automated theorem proving Logic puzzles Recreational mathematics Constraint programming Sudoku Constraint satisfaction Boolean satisfiability problem Unit propagation Mathematics Theoretical computer science Applied mathematics
908	Navigrid Examples Navigrid is a fantastic new logic puzzle. Place the digits 1 to 9 so that it is possible to jump from one digit to the next, in order, using the steps provided. An example step is down then one left. Add to Reading List Source URL: www.vexuspuzzle.com Language: English - Date: 2008-09-20 12:58:03 Recreational mathematics NP-complete problems Puzzles Mechanical puzzles Problem solving Navigrid T puzzle Logic puzzles Mathematics Games
909	Finding Adam in random growing trees S´ebastien Bubeck ∗ Luc Devroye Add to Reading List Source URL: www.princeton.edu Language: English - Date: 2014-11-13 00:16:29 Tree Graph coloring NP-complete problems Euclidean algorithm Graph theory Mathematics Theoretical computer science
910	A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, and Marco Maratea MRG-DIST, University of Genova viale Francesco Causa, 13 Add to Reading List Source URL: www.satisfiability.org Language: English - Date: 2014-01-20 06:08:37 Constraint programming Model theory Automated theorem proving Logic in computer science NP-complete problems Boolean satisfiability problem Constraint satisfaction Satisfiability Interpretation Theoretical computer science Mathematical logic Mathematics

UPDATE